2DST MAPPINGS ON LANGUAGES AND RELATED PROBLEMSIBARRA OH.1982; THEORETICAL COMPUTER SCIENCES; ISSN 0304-3975; NLD; DA. 1982; VOL. 19; NO 2; PP. 219-227; BIBL. 27 REF.Article

A HIERARCHY THEOREM FOR POLYNOMIAL-SPACE RECOGNITION.IBARRA OH.1974; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1974; VOL. 3; NO 3; PP. 184-187; BIBL. 6 REF.Article

ON TWO-WAY MULTIHEAD AUTOMATAIBARRA OH.1973; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1973; VOL. 7; NO 1; PP. 28-36; BIBL. 8 REF.Serial Issue

REVERSAL-BOUNDED MULTICOUNTER MACHINES AND THEIR DECISION PROBLEMS.IBARRA OH.1978; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1978; VOL. 25; NO 1; PP. 116-133; BIBL. 27 REF.Article

THE UNSOLVABILITY OF EQUIVALENCE PROBLEM FOR EPSILON -FREE NGSM'S WITH UNARY INPUT (OUTPUT) ALPHABET AND APPLICATIONSIBARRA OH.1978; S.I.A.M.J. COMPUTG; USA; DA. 1978; VOL. 7; NO 4; PP. 524-532; BIBL. 7 REF.Article

RESTRICTED ONE-COUNTER MACHINES WITH UNDECIDABLE UNIVERSE PROBLEMSIBARRA OH.1979; MATH. SYST. THEORY; USA; DA. 1979; VOL. 13; NO 2; PP. 181-186; BIBL. 10 REF.Article

A NOTE ON SEMILINEAR SETS AND BOUNDED-REVERSAL MULTIHEAD PUSHDOWN AUTOMATA.IBARRA OH.1974; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1974; VOL. 3; NO 1; PP. 25-28; BIBL. 7 REF.Article

A NOTE CONCERNING NONDETERMINISTIC TAPE COMPLEXITIESIBARRA OH.1972; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1972; VOL. 19; NO 4; PP. 608-612; BIBL. 9 REF.Serial Issue

SOME SIMPLIFIED UNDECIDABLE AND NP-HARD PROBLEMS FOR SIMPLE PROGRAMSGURANI EM; IBARRA OH.1982; THEOR. COMPUT. SCI.; NLD; DA. 1982; VOL. 17; NO 1; PP. 55-73; BIBL. 13 REF.Article

TWO-WAY COUNTER MACHINES AND DIOPHANTINE EQUATIONSGURARI EM; IBARRA OH.1982; J. ASSOC. COMPUT. MACH.; ISSN 0004-5411; USA; DA. 1982; VOL. 29; NO 3; PP. 863-873; BIBL. 10 REF.Article

THE COMPLEXITY OF DECISION PROBLEMS FOR FINITE-TURN MULTICOUNTER MACHINESGURARI EM; IBARRA OH.1981; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1981; VOL. 22; NO 2; PP. 220-229; BIBL. 18 REF.Article

PATH SYSTEMS: CONSTRUCTIONS, SOLUTIONS AND APPLICATIONSGURARI EM; IBARRA OH.1980; S.I.A.M. J. COMPUTG.; USA; DA. 1980; VOL. 9; NO 2; PP. 348-374; BIBL. 18 REF.Article

STRAIGHT-LINE PROGRAMS WITH ONE INPUT VARIABLEIBARRA OH; LEININGER BS.1982; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1982; VOL. 11; NO 1; PP. 1-14; BIBL. 7 REF.Article

THE COMPLEXITY OF THE EQUIVALENCE PROBLEM FOR SIMPLE LOOP-FREE PROGRAMSIBARRA OH; LEININGER BS.1982; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1982; VOL. 11; NO 1; PP. 15-27; BIBL. 9 REF.Article

ON RESTRICTED ONE-COUNTER MACHINESIBARRA OH; ROSIER LE.1981; MATH. SYST. THEORY; ISSN 0025-5661; DEU; DA. 1981; VOL. 14; NO 3; PP. 241-245; BIBL. 5 REF.Article

THE COMPLEXITY OF THE EQUIVALENCE PROBLEM FOR STRAIGHT-LINE PROGRAMSIBARRA OH; LEININGER BS.1980; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON THEORY OF COMPUTING. 12/1980/LOS ANGELES CA; USA; NEW YORK: ACM; DA. 1980; PP. 273-280; BIBL. 17 REF.Conference Paper

A USEFUL DEVICE FOR SHOWING THE SOLVABILITY OF SOME DECISION PROBLEMS.IBARRA OH; KIM CE.1976; J. COMPUTER SYST.; U.S.A.; DA. 1976; VOL. 13; NO 2; PP. 153-160; BIBL. 12 REF.Article

FAST APPROXIMATION ALGORITHMS FOR THE KNAPSACK AND SUM OF SUBSET PROBLEMS.IBARRA OH; KIM CE.1975; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1975; VOL. 22; NO 4; PP. 463-468; BIBL. 11 REF.Article

ON TWO-PROCESSOR SCHEDULING OF ONE OR TWO-UNIT TIME TASKS WITH PRECEDENCE CONSTRAINTS.IBARRA OH; KIM CE.1975; J. CYBERN.; U.S.A.; DA. 1975 PARU 1976; VOL. 5; NO 3; PP. 87-109; BIBL. 8 REF.Article

PROBABILISTIC ALGORITHMS FOR DECIDING EQUIVALENCE OF STRAIGHT-LINE PROGRAMSIBARRA OH; MORAN S.1983; JOURNAL OF THE ASSOCIATION FOR COMPUTING MACHINERY; ISSN 0004-5411; USA; DA. 1983; VOL. 30; NO 1; PP. 217-228; BIBL. 19 REF.Article

SOME TIME-SPACE TRADEOFF RESULTS CONCERNING SINGLE-TAPE AND OFFLINE TM'SIBARRA OH; MORAN S.1983; SIAM JOURNAL ON COMPUTING; ISSN 0097-5397; USA; DA. 1983; VOL. 12; NO 2; PP. 388-394; BIBL. 6 REF.Article

ON THE SPACE COMPLEXITY OF RECURSIVE ALGORITHMSGURARI EM; IBARRA OH.1979; INFORM. PROCESSG LETTERS; NLD; DA. 1979; VOL. 8; NO 5; PP. 267-271; BIBL. 5 REF.Article

AN NP-COMPLETE NUMBER-THEORETIC PROBLEMGURARI EM; IBARRA OH.1979; J. ASS. COMPUTG MACHIN; USA; DA. 1979; VOL. 26; NO 3; PP. 567-581; BIBL. 18 REF.Article

HEURISTIC ALGORITHMS FOR SCHEDULING INDEPENDENT TASKS ON NONIDENTICAL PROCESSORS.IBARRA OH; KIM CE.1977; J. ASS. COMPUTG. MACHIN.; U.S.A.; DA. 1977; VOL. 24; NO 2; PP. 280-289; BIBL. 9 REF.Article

ON 3-HEARD VERSUS 2-HEAD FINITE AUTOMATA.IBARRA OH; KIM CE.1975; ACTA INFORMAT.; ALLEM.; DA. 1975; VOL. 4; NO 2; PP. 193-100; BIBL. 5 REF.Article